Back to course home
0% completed
Vote For New Content
Oracle Medium
Longest Palindromic Substring (medium)
Solution: Longest Palindromic Substring
Single Element in a Sorted Array (medium)
Solution: Single Element in a Sorted Array
Pairs of Songs With Total Durations Divisible by 60 (medium)
Solution: Pairs of Songs With Total Durations Divisible by 60
Search a 2D Matrix II (medium)
Solution: Search a 2D Matrix II
Minimize Maximum of Array (medium)
Solution: Minimize Maximum of Array
Asteroid Collision (medium)
Solution: Asteroid Collision
Combination Sum (medium)
Solution: Combination Sum
Binary Tree Right Side View (medium)
Solution: Binary Tree Right Side View
Sort Colors (medium)
Solution: Sort Colors
Group Anagrams (Medium)
Solution: Group Anagrams
Decode String (Medium)
Solution: Decode String
Number of Islands (medium)
Solution: Number of Islands
Binary Tree Zigzag Level Order Traversal (medium)
Solution: Binary Tree Zigzag Level Order Traversal
Longest Common Subsequence (medium)
Solution: Longest Common Subsequence
Rotting Oranges (medium)
Solution: Rotting Oranges
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Spiral Matrix (medium)
Solution: Spiral Matrix
Container With Most Water (Medium)
Solution: Container With Most Water
3Sum (medium)
Solution: 3Sum
Simplify Path (medium)
Solution: Simplify Path
Next Permutation (medium)
Solution: Next Permutation
Basic Calculator II (medium)
Solution: Basic Calculator II
Merge Intervals (medium)
Solution: Merge Intervals
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Longest Increasing Subsequence (medium)
Solution: Longest Increasing Subsequence
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Oracle Hard
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Solution: Valid Parentheses
Problem Statement
Determine if an input string containing only the characters '(', ')', '{', '}', '[', and ']' is valid. A string is considered valid if:
- Open brackets must be closed by the same type of brackets.
- Open brackets must be closed in the correct order.
- Each close bracket has a corresponding open bracket of the same type.
Examples
-
- Input:
"(]" - Expected Output:
false - Justification: The opening parenthesis '(' is not closed by its corresponding closing parenthesis.
- Input:
-
- Input:
"{[]}" - Expected Output:
true - Justification: The string contains pairs of opening and closing brackets in the correct order.
- Input:
-
- Input:
"[{]}" - Expected Output:
false - Justification: The opening square bracket '[' is closed by a curly brace '}', which is incorrect.
- Input:
Constraints:
- 1 <= s.length <= 104
sconsists of parentheses only '()[]{}'.
Solution
- Initialization:
- Start with an empty stack.
- For every bracket in the input string:
- If the bracket is an opening bracket ('(', '{', '['), push it onto the stack.
- If the bracket is a closing bracket (')', '}', ']'):
- If the stack is empty, return false.
- Pop the top of the stack and check if it matches the corresponding opening bracket.
- Validation:
- If the current closing bracket doesn't match the top of the stack, return false.
- If the stack is not empty after processing all brackets in the string, return false.
- Final Output:
- If the stack is empty at the end, return true, indicating that the string has valid parentheses.
Algorithm Walkthrough
Using the input "{[]}":
- Start with an empty stack.
- Encounter '{', push onto the stack.
- Encounter '[', push onto the stack.
- Encounter ']', pop from the stack and check if the popped character is '['. It matches, so continue.
- Encounter '}', pop from the stack and check if the popped character is '{'. It matches.
- The string is processed and the stack is empty, so return true.
Code
Java
. . . .
Complexity Analysis
- Time Complexity: O(n) where n is the length of the string. Each character is processed once.
- Space Complexity: O(n) in the worst case when all characters are opening brackets.
Valid Parentheses (Easy)
Longest Palindromic Substring (medium)
Mark as Completed
On this page
Problem Statement
Examples
Solution
Algorithm Walkthrough
Code
Complexity Analysis